Causal effect identification in acyclic directed mixed graphs and gated models
نویسندگان
چکیده
منابع مشابه
Causal Effect Identification in Acyclic Directed Mixed Graphs and Gated Models
We introduce a new family of graphical models that consists of graphs with possibly directed, undirected and bidirected edges but without directed cycles. We show that these models are suitable for representing causal models with additive error terms. We provide a set of sufficient graphical criteria for the identification of arbitrary causal effects when the new models contain directed and und...
متن کاملCausal Effect Identification in Alternative Acyclic Directed Mixed Graphs
Alternative acyclic directed mixed graphs (ADMGs) are graphs that may allow causal effect identification in scenarios where Pearl’s original ADMGs may not, and vice versa. Therefore, they complement each other. In this paper, we introduce a sound algorithm for identifying arbitrary causal effects from alternative ADMGs. Moreover, we show that the algorithm is complete for identifying the causal...
متن کاملAlternative Markov and Causal Properties for Acyclic Directed Mixed Graphs
We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to two edges between any pair of nodes. We introduce global, and ordered local and pairwise Markov properties for the new models. We show the equivalence of these properties for strictly positive probability distributions. We also...
متن کاملSigned directed acyclic graphs for causal inference.
Formal rules governing signed edges on causal directed acyclic graphs are described in this paper and it is shown how these rules can be useful in reasoning about causality. Specifically, the notions of a monotonic effect, a weak monotonic effect and a signed edge are introduced. Results are developed relating these monotonic effects and signed edges to the sign of the causal effect of an inter...
متن کاملMarkov Properties for Acyclic Directed Mixed Graphs
We consider acyclic directed mixed graphs, in which directed edges (x → y) and bi-directed edges (x ↔ y) may occur. A simple extension of Pearl’s d-separation criterion, called m-separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m-separation criterion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2017
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2017.06.015